On local search based heuristics for optimization problems
نویسندگان
چکیده
منابع مشابه
On local search based heuristics for optimization problems
When comparing various metaheuristics, even asking a fair and formally consistent question is often difficult. Having this in mind, we provide some further evidence that simple local search heuristics may be at least a very competitive choice. On a dataset from an industrial application, i.e., construction of an optical system, we compare local search and genetic algorithms. In our case, the be...
متن کاملLocal Search Heuristics for Facility Location Problems
In this thesis, we develop approximation algorithms for facility location problems based on local search techniques. Facility location is an important problem in operations research. Heuristic approaches have been used to solve many variants of the problem since the 1960s. The study of approximation algorithms for facility location problems started with the work of Hochbaum. Although local sear...
متن کاملA Framework for the Development of Local Search Heuristics for Combinatorial Optimization Problems
In the study of heuristics for combinatorial problems, it is often important to develop and compare, in a systematic way, different algorithms, strategies, and parameters for the same problem. The central issue in this paper is that, by modeling (using the object-oriented programming paradigm) in separate classes the different aspects involved in local search based methods, we increase our abil...
متن کاملImproving Local Search Heuristics for Some Scheduling Problems-I
Local search techniques like simulated annealing and tabu search are based on a neighborhood structure defined on a set of feasible solutions of a discrete optimization problem. For the scheduling problems P2 /) C,,,, 11 precl c C, and 1 112 T, we replace a simple neighborhood by a neighborhood on the set of all locally optimal solutions. This allows local search on the set of solutions that ar...
متن کاملImproving Local Search Heuristics for some Scheduling Problems. Part II
Local search techniques like simulated annealing and tabu search are based on a neighborhood structure defined on the set of feasible solutions of a discrete optimization problem. For the scheduling problems Pm )I C,,,,, 1 1 prec 1 1 Ui, and a large class of sequencing problems with precedence constraints having local interchange properties we replace a simple neighborhood by a neighborhood on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Croatian Operational Research Review
سال: 2014
ISSN: 1848-0225,1848-9931
DOI: 10.17535/crorr.2014.0016